
<!DOCTYPE HTML>
<html lang="" >
    <head>
        <meta charset="UTF-8">
        <meta content="text/html; charset=utf-8" http-equiv="Content-Type">
        <title>线性表的链式表示和实现 · GitBook</title>
        <meta http-equiv="X-UA-Compatible" content="IE=edge" />
        <meta name="description" content="">
        <meta name="generator" content="GitBook 3.2.3">
        
        
        
    
    <link rel="stylesheet" href="../gitbook/style.css">

    
            
                
                <link rel="stylesheet" href="../gitbook/gitbook-plugin-highlight/website.css">
                
            
                
                <link rel="stylesheet" href="../gitbook/gitbook-plugin-search/search.css">
                
            
                
                <link rel="stylesheet" href="../gitbook/gitbook-plugin-fontsettings/website.css">
                
            
        

    

    
        
    
        
    
        
    
        
    
        
    
        
    

        
    
    
    <meta name="HandheldFriendly" content="true"/>
    <meta name="viewport" content="width=device-width, initial-scale=1, user-scalable=no">
    <meta name="apple-mobile-web-app-capable" content="yes">
    <meta name="apple-mobile-web-app-status-bar-style" content="black">
    <link rel="apple-touch-icon-precomposed" sizes="152x152" href="../gitbook/images/apple-touch-icon-precomposed-152.png">
    <link rel="shortcut icon" href="../gitbook/images/favicon.ico" type="image/x-icon">

    
    <link rel="next" href="../chapter3/chapter3.html" />
    
    
    <link rel="prev" href="顺序表.html" />
    

    </head>
    <body>
        
<div class="book">
    <div class="book-summary">
        
            
<div id="book-search-input" role="search">
    <input type="text" placeholder="Type to search" />
</div>

            
                <nav role="navigation">
                


<ul class="summary">
    
    

    

    
        
        
    
        <li class="chapter " data-level="1.1" data-path="../">
            
                <a href="../">
            
                    
                    数据结构（C语言版） 复习总结
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.2" data-path="../chapter1.html">
            
                <a href="../chapter1.html">
            
                    
                    第一章 绪论
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.3" data-path="chapter2.html">
            
                <a href="chapter2.html">
            
                    
                    第二章 线性表
            
                </a>
            

            
            <ul class="articles">
                
    
        <li class="chapter " data-level="1.3.1" data-path="顺序表.html">
            
                <a href="顺序表.html">
            
                    
                    线性表的顺序表示和实现
            
                </a>
            

            
        </li>
    
        <li class="chapter active" data-level="1.3.2" data-path="链表.html">
            
                <a href="链表.html">
            
                    
                    线性表的链式表示和实现
            
                </a>
            

            
        </li>
    

            </ul>
            
        </li>
    
        <li class="chapter " data-level="1.4" data-path="../chapter3/chapter3.html">
            
                <a href="../chapter3/chapter3.html">
            
                    
                    第三章 栈和队列
            
                </a>
            

            
            <ul class="articles">
                
    
        <li class="chapter " data-level="1.4.1" data-path="../chapter3/栈.html">
            
                <a href="../chapter3/栈.html">
            
                    
                    抽象数据类型栈的定义和实现
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.4.2" data-path="../chapter3/队列.html">
            
                <a href="../chapter3/队列.html">
            
                    
                    抽象数据类型队列的定义和实现
            
                </a>
            

            
        </li>
    

            </ul>
            
        </li>
    
        <li class="chapter " data-level="1.5" >
            
                <span>
            
                    
                    第四章 串
            
                </span>
            

            
            <ul class="articles">
                
    
        <li class="chapter " data-level="1.5.1" data-path="../chapter4/串类型.html">
            
                <a href="../chapter4/串类型.html">
            
                    
                    串类型的定义
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.5.2" data-path="../chapter4/串的表示和实现.html">
            
                <a href="../chapter4/串的表示和实现.html">
            
                    
                    串的表示和实现
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.5.3" data-path="../chapter4/串的模式匹配算法.html">
            
                <a href="../chapter4/串的模式匹配算法.html">
            
                    
                    串的模式匹配算法
            
                </a>
            

            
        </li>
    

            </ul>
            
        </li>
    
        <li class="chapter " data-level="1.6" >
            
                <span>
            
                    
                    第五章 数组和广义表
            
                </span>
            

            
            <ul class="articles">
                
    
        <li class="chapter " data-level="1.6.1" data-path="../chapter5/数组的定义.html">
            
                <a href="../chapter5/数组的定义.html">
            
                    
                    数组的定义
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.6.2" data-path="../chapter5/矩阵的压缩存储.html">
            
                <a href="../chapter5/矩阵的压缩存储.html">
            
                    
                    矩阵的压缩存储
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.6.3" data-path="../chapter5/广义表.html">
            
                <a href="../chapter5/广义表.html">
            
                    
                    广义表
            
                </a>
            

            
        </li>
    

            </ul>
            
        </li>
    
        <li class="chapter " data-level="1.7" >
            
                <span>
            
                    
                    第六章 树和二叉树
            
                </span>
            

            
            <ul class="articles">
                
    
        <li class="chapter " data-level="1.7.1" data-path="../chapter6/树.html">
            
                <a href="../chapter6/树.html">
            
                    
                    树的定义与基本术语
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.7.2" data-path="../chapter6/二叉树.html">
            
                <a href="../chapter6/二叉树.html">
            
                    
                    二叉树
            
                </a>
            

            
            <ul class="articles">
                
    
        <li class="chapter " data-level="1.7.2.1" data-path="../chapter6/二叉树的二叉链表实现.html">
            
                <a href="../chapter6/二叉树的二叉链表实现.html">
            
                    
                    二叉树的二叉链表实现
            
                </a>
            

            
        </li>
    

            </ul>
            
        </li>
    
        <li class="chapter " data-level="1.7.3" data-path="../chapter6/遍历二叉树和线索二叉树.html">
            
                <a href="../chapter6/遍历二叉树和线索二叉树.html">
            
                    
                    遍历二叉树和线索二叉树
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.7.4" data-path="../chapter6/树和森林.html">
            
                <a href="../chapter6/树和森林.html">
            
                    
                    树和森林
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.7.5" data-path="../chapter6/赫夫曼树.html">
            
                <a href="../chapter6/赫夫曼树.html">
            
                    
                    赫夫曼树
            
                </a>
            

            
        </li>
    

            </ul>
            
        </li>
    
        <li class="chapter " data-level="1.8" >
            
                <span>
            
                    
                    第七章 图
            
                </span>
            

            
            <ul class="articles">
                
    
        <li class="chapter " data-level="1.8.1" data-path="../chapter7/图.html">
            
                <a href="../chapter7/图.html">
            
                    
                    图的定义
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.8.2" data-path="../chapter7/图的存储结构.html">
            
                <a href="../chapter7/图的存储结构.html">
            
                    
                    图的存储结构
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.8.3" data-path="../chapter7/图的遍历.html">
            
                <a href="../chapter7/图的遍历.html">
            
                    
                    图的遍历
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.8.4" data-path="../chapter7/最小生成树.html">
            
                <a href="../chapter7/最小生成树.html">
            
                    
                    最小生成树
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.8.5" data-path="../chapter7/有向无环图.html">
            
                <a href="../chapter7/有向无环图.html">
            
                    
                    有向无环图的应用
            
                </a>
            

            
        </li>
    

            </ul>
            
        </li>
    
        <li class="chapter " data-level="1.9" data-path="../chapter8/查找.html">
            
                <a href="../chapter8/查找.html">
            
                    
                    第八章 查找
            
                </a>
            

            
            <ul class="articles">
                
    
        <li class="chapter " data-level="1.9.1" data-path="../chapter8/静态查找表.html">
            
                <a href="../chapter8/静态查找表.html">
            
                    
                    静态查找表
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.9.2" data-path="../chapter8/动态查找表.html">
            
                <a href="../chapter8/动态查找表.html">
            
                    
                    动态查找表
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.9.3" data-path="../chapter8/哈希表.html">
            
                <a href="../chapter8/哈希表.html">
            
                    
                    哈希表
            
                </a>
            

            
        </li>
    

            </ul>
            
        </li>
    
        <li class="chapter " data-level="1.10" data-path="../chapter9/内部排序.html">
            
                <a href="../chapter9/内部排序.html">
            
                    
                    第九章 内部排序
            
                </a>
            

            
            <ul class="articles">
                
    
        <li class="chapter " data-level="1.10.1" data-path="../chapter9/插入排序.html">
            
                <a href="../chapter9/插入排序.html">
            
                    
                    插入排序
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.10.2" data-path="../chapter9/选择排序.html">
            
                <a href="../chapter9/选择排序.html">
            
                    
                    选择排序
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.10.3" data-path="../chapter9/快速排序.html">
            
                <a href="../chapter9/快速排序.html">
            
                    
                    快速排序
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.10.4" data-path="../chapter9/归并排序和基数排序.html">
            
                <a href="../chapter9/归并排序和基数排序.html">
            
                    
                    归并排序和基数排序
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.10.5" data-path="../chapter9/排序方法的比较.html">
            
                <a href="../chapter9/排序方法的比较.html">
            
                    
                    排序方法的比较
            
                </a>
            

            
        </li>
    

            </ul>
            
        </li>
    

    

    <li class="divider"></li>

    <li>
        <a href="https://www.gitbook.com" target="blank" class="gitbook-link">
            Published with GitBook
        </a>
    </li>
</ul>


                </nav>
            
        
    </div>

    <div class="book-body">
        
            <div class="body-inner">
                
                    

<div class="book-header" role="navigation">
    

    <!-- Title -->
    <h1>
        <i class="fa fa-circle-o-notch fa-spin"></i>
        <a href=".." >线性表的链式表示和实现</a>
    </h1>
</div>




                    <div class="page-wrapper" tabindex="-1" role="main">
                        <div class="page-inner">
                            
<div id="book-search-results">
    <div class="search-noresults">
    
                                <section class="normal markdown-section">
                                
                                <h2 id="&#x7EBF;&#x6027;&#x8868;&#x7684;&#x94FE;&#x5F0F;&#x8868;&#x793A;&#x548C;&#x5B9E;&#x73B0;">&#x7EBF;&#x6027;&#x8868;&#x7684;&#x94FE;&#x5F0F;&#x8868;&#x793A;&#x548C;&#x5B9E;&#x73B0;</h2>
<p>&#x7EBF;&#x6027;&#x8868;&#x7684;&#x94FE;&#x5F0F;&#x5B58;&#x50A8;&#x7ED3;&#x6784;&#x7684;&#x7279;&#x70B9;&#x662F;&#x7528;&#x4E00;&#x7EC4;&#x4EFB;&#x610F;&#x7684;&#x5B58;&#x50A8;&#x5355;&#x5143;&#x5B58;&#x50A8;&#x7EBF;&#x6027;&#x8868;&#x7684;&#x6570;&#x636E;&#x5143;&#x7D20;&#x3002;&#x5BF9;&#x4E8E;&#x6570;&#x636E;&#x5143;&#x7D20; a<sub>i</sub> &#x6765;&#x8BF4;&#xFF0C;&#x9664;&#x4E86;&#x5B58;&#x50A8;&#x5668;&#x672C;&#x8EAB;&#x7684;&#x4FE1;&#x606F;&#x4E4B;&#x5916;&#xFF0C;&#x8FD8;&#x9700;&#x8981;&#x5B58;&#x50A8;&#x4E00;&#x4E2A;&#x6307;&#x793A;&#x5176;&#x76F4;&#x63A5;&#x540E;&#x7EE7;&#x7684;&#x4FE1;&#x606F;&#xFF08;&#x5373;&#x76F4;&#x63A5;&#x540E;&#x7EE7;&#x7684;&#x5B58;&#x50A8;&#x4F4D;&#x7F6E;&#xFF09;&#x3002;&#x8FD9;&#x4E24;&#x90E8;&#x5206;&#x4FE1;&#x606F;&#x7EC4;&#x6210;&#x6570;&#x636E;&#x5143;&#x7D20; a<sub>i</sub> &#x7684;&#x5B58;&#x50A8;&#x6620;&#x50CF;&#xFF0C;&#x6210;&#x4E3A;<strong>&#x7ED3;&#x70B9;</strong>&#xFF08;<code>Node</code>&#xFF09;&#x3002;&#x5305;&#x62EC;&#x4E24;&#x4E2A;&#x57DF;&#xFF1A;</p>
<ul>
<li><strong>&#x6570;&#x636E;&#x57DF;</strong>&#xFF1A;&#x5B58;&#x50A8;&#x6570;&#x636E;&#x5143;&#x7D20;&#x4FE1;&#x606F;</li>
<li><strong>&#x6307;&#x9488;&#x57DF;</strong>&#xFF1A;&#x5B58;&#x50A8;&#x76F4;&#x63A5;&#x540E;&#x7EE7;&#x7684;&#x5B58;&#x50A8;&#x4F4D;&#x7F6E;</li>
</ul>
<p>n &#x4E2A;&#x7ED3;&#x70B9;&#x94FE;&#x7ED3;&#x6210;&#x4E00;&#x4E2A;<strong>&#x94FE;&#x8868;</strong>&#xFF0C;&#x5373;&#x4E3A;&#x7EBF;&#x6027;&#x8868;&#x7684;<strong>&#x94FE;&#x5F0F;&#x5B58;&#x50A8;&#x7ED3;&#x6784;</strong>&#x3002;</p>
<ul>
<li>&#x6574;&#x4E2A;&#x94FE;&#x8868;&#x7684;&#x5B58;&#x53D6;&#x4ECE;<strong>&#x5934;&#x6307;&#x9488;</strong>&#x5F00;&#x59CB;&#x8FDB;&#x884C;&#xFF0C;&#x5934;&#x6307;&#x9488;&#x6307;&#x793A;&#x94FE;&#x8868;&#x4E2D;&#x7B2C;&#x4E00;&#x4E2A;&#x7ED3;&#x70B9;&#x7684;&#x5B58;&#x50A8;&#x4F4D;&#x7F6E;<ul>
<li>&#x6211;&#x4EEC;&#x5728;&#x5355;&#x94FE;&#x8868;&#x7684;&#x7B2C;&#x4E00;&#x4E2A;&#x7ED3;&#x70B9;&#x4E4B;&#x524D;&#x9644;&#x8BBE;&#x4E00;&#x4E2A;&#x7ED3;&#x70B9;&#xFF0C;&#x79F0;&#x4E4B;&#x4E3A;<strong>&#x5934;&#x7ED3;&#x70B9;</strong></li>
<li>&#x5934;&#x7ED3;&#x70B9;&#x7684;&#x6570;&#x636E;&#x57DF;&#x53EF;&#x4EE5;&#x5B58;&#x50A8;&#x7EBF;&#x6027;&#x8868;&#x7684;&#x957F;&#x5EA6;&#x6216;&#x8005;&#x4E0D;&#x5B58;&#x50A8;</li>
<li>&#x5934;&#x7ED3;&#x70B9;&#x7684;&#x6307;&#x9488;&#x57DF;&#x5B58;&#x50A8;&#x7B2C;&#x4E00;&#x4E2A;&#x7ED3;&#x70B9;&#x7684;&#x5B58;&#x50A8;&#x4F4D;&#x7F6E;</li>
</ul>
</li>
<li>&#x82E5;&#x5934;&#x7ED3;&#x70B9;&#x7684;&#x6307;&#x9488;&#x57DF;&#x4E3A;&#x201C;&#x7A7A;&#x201D;&#xFF08;NULL&#xFF09;&#xFF0C;&#x5219;&#x6240;&#x8868;&#x793A;&#x7684;&#x7EBF;&#x6027;&#x8868;&#x4E3A;&#x201C;&#x7A7A;&#x8868;&#x201D;&#xFF0C;&#x5176;&#x957F;&#x5EA6; n &#x4E3A;&#x201C;&#x96F6;&#x201D;</li>
<li>&#x6700;&#x540E;&#x4E00;&#x4E2A;&#x6570;&#x636E;&#x5143;&#x7D20;&#x6CA1;&#x6709;&#x76F4;&#x63A5;&#x540E;&#x7EE7;&#xFF0C;&#x6700;&#x540E;&#x4E00;&#x4E2A;&#x7ED3;&#x70B9;&#x7684;&#x6307;&#x9488;&#x4E3A;<strong>&#x201C;&#x7A7A;&#x201D;</strong>&#xFF08;<code>NULL</code>&#xFF09;</li>
<li>&#x5728;&#x5355;&#x94FE;&#x8868;&#x4E2D;&#xFF0C;&#x53D6;&#x5F97;&#x7B2C; i &#x4E2A;&#x6570;&#x636E;&#x5143;&#x7D20;&#x5FC5;&#x987B;&#x4ECE;&#x5934;&#x6307;&#x9488;&#x51FA;&#x53D1;&#x5BFB;&#x627E;&#xFF0C;&#x56E0;&#x6B64;&#x5355;&#x94FE;&#x8868;&#x662F;<strong>&#x975E;&#x968F;&#x673A;&#x5B58;&#x53D6;&#x7684;&#x5B58;&#x50A8;&#x7ED3;&#x6784;</strong></li>
</ul>
<h3 id="&#x94FE;&#x5F0F;&#x5B58;&#x50A8;&#x7ED3;&#x6784;&#x7684;&#x5B9E;&#x73B0;&#xFF1A;">&#x94FE;&#x5F0F;&#x5B58;&#x50A8;&#x7ED3;&#x6784;&#x7684;&#x5B9E;&#x73B0;&#xFF1A;</h3>
<pre><code class="lang-C"><span class="hljs-keyword">typedef</span> <span class="hljs-keyword">int</span> ElemType; <span class="hljs-comment">// &#x5B9A;&#x4E49;&#x7EBF;&#x6027;&#x8868;&#x7684;&#x6570;&#x636E;&#x7C7B;&#x578B;</span>

<span class="hljs-comment">/**
 * &#x5B9A;&#x4E49;&#x5355;&#x94FE;&#x8868;&#x7684;&#x6570;&#x636E;&#x5143;&#x7D20;&#x7ED3;&#x6784;
 */</span>
<span class="hljs-keyword">typedef</span> <span class="hljs-keyword">struct</span> LNode
{
    ElemType data;
    <span class="hljs-keyword">struct</span> LNode *next;
}LNode, *LinkList;

<span class="hljs-comment">// LinkList &#x7B49;&#x4EF7;&#x4E8E; LNode *</span>
<span class="hljs-comment">// &#x82E5;&#x8BBE; LNode *p; LinkList H; </span>
<span class="hljs-comment">// &#x5219; p, q, H &#x90FD;&#x662F;&#x6307;&#x9488;&#x53D8;&#x91CF;</span>

<span class="hljs-meta">#<span class="hljs-meta-keyword">define</span> NODESIZE sizeof(LNode) <span class="hljs-comment">// &#x5355;&#x4E2A;&#x7ED3;&#x70B9;&#x5360;&#x7528;&#x7684;&#x5B58;&#x50A8;&#x7A7A;&#x95F4;</span></span>

<span class="hljs-comment">/**
 * &#x521D;&#x59CB;&#x5316;&#x5355;&#x94FE;&#x8868; 
 * L &#x4E3A;&#x5355;&#x94FE;&#x8868;&#x7684;&#x5934;&#x6307;&#x9488; 
 */</span>
<span class="hljs-function"><span class="hljs-keyword">void</span> <span class="hljs-title">initList</span><span class="hljs-params">(LinkList &amp;L)</span>
</span>{
    L = (LinkList) <span class="hljs-built_in">malloc</span>(NODESIZE);
    L-&gt;next = <span class="hljs-literal">NULL</span>;
}

<span class="hljs-comment">/**
 * &#x4ECE;&#x8868;&#x5934;&#x5230;&#x8868;&#x5C3E;&#x987A;&#x5E8F;&#x5EFA;&#x7ACB;&#x5355;&#x94FE;&#x8868; 
 */</span>
<span class="hljs-function"><span class="hljs-keyword">void</span> <span class="hljs-title">creatList</span><span class="hljs-params">(LinkList &amp;L, <span class="hljs-keyword">int</span> n)</span>
</span>{
    <span class="hljs-keyword">int</span> i;
    LinkList p = L, q;
    <span class="hljs-keyword">for</span> (i = <span class="hljs-number">0</span>; i &lt; n; i++)
    {
        q = (LinkList) <span class="hljs-built_in">malloc</span>(NODESIZE);
        q-&gt;data = i;
        q-&gt;next = p-&gt;next;
        p-&gt;next = q;
        p = p-&gt;next;
    }
}

<span class="hljs-comment">/**
 * &#x904D;&#x5386;&#x8F93;&#x51FA;&#x5355;&#x94FE;&#x8868;&#x5143;&#x7D20; 
 */</span>
<span class="hljs-function"><span class="hljs-keyword">void</span> <span class="hljs-title">printList</span><span class="hljs-params">(LinkList L)</span>
</span>{
    LinkList p = L-&gt;next;
    <span class="hljs-keyword">while</span>(p)
    {
        <span class="hljs-built_in">printf</span>(<span class="hljs-string">&quot;%d &quot;</span>, p-&gt;data);
        p = p-&gt;next;
    }
    <span class="hljs-built_in">printf</span>(<span class="hljs-string">&quot;\n&quot;</span>);
} 

<span class="hljs-comment">/**
 * &#x83B7;&#x53D6;&#x7B2C; i &#x4E2A;&#x6570;&#x636E;&#x5143;&#x7D20;
 */</span>
<span class="hljs-function">ElemType <span class="hljs-title">getElem</span><span class="hljs-params">(LinkList L, <span class="hljs-keyword">int</span> i)</span>
</span>{
    LinkList p = L-&gt;next; <span class="hljs-comment">// &#x6307;&#x9488; p &#x6307;&#x5411;&#x7B2C;&#x4E00;&#x4E2A;&#x7ED3;&#x70B9;</span>
    <span class="hljs-keyword">int</span> j = <span class="hljs-number">1</span>; <span class="hljs-comment">// j &#x4E3A;&#x8BA1;&#x6570;&#x5668;</span>
    <span class="hljs-keyword">while</span> (p &amp;&amp; j &lt; i)
    {
        p = p-&gt;next; <span class="hljs-comment">// &#x987A;&#x6307;&#x9488;&#x5411;&#x540E;&#x67E5;&#x627E;&#xFF0C;&#x76F4;&#x5230; p &#x6307;&#x5411;&#x7B2C; i &#x4E2A;&#x5143;&#x7D20;</span>
        j++;
    }
    <span class="hljs-keyword">if</span> (!p || j &gt; i) <span class="hljs-comment">// &#x7B2C; i &#x4E2A;&#x5143;&#x7D20;&#x4E0D;&#x5B58;&#x5728;</span>
    {
        <span class="hljs-built_in">printf</span>(<span class="hljs-string">&quot;ERROR\n&quot;</span>);
        <span class="hljs-keyword">return</span> <span class="hljs-number">-1</span>;
    }
    <span class="hljs-keyword">return</span> p-&gt;data;
}

<span class="hljs-comment">/**
 * &#x5355;&#x94FE;&#x8868;&#x7B2C; i &#x4E2A;&#x4F4D;&#x7F6E;&#x4E4B;&#x524D;&#x63D2;&#x5165;&#x5143;&#x7D20; e
 */</span>
<span class="hljs-function"><span class="hljs-keyword">void</span> <span class="hljs-title">insertElem</span><span class="hljs-params">(LinkList &amp;L, <span class="hljs-keyword">int</span> i, ElemType e)</span>
</span>{
    LinkList p = L, s;
    <span class="hljs-keyword">int</span> j = <span class="hljs-number">0</span>;
    <span class="hljs-keyword">while</span> (p &amp;&amp; j &lt; i<span class="hljs-number">-1</span> ) <span class="hljs-comment">// &#x6307;&#x9488; p &#x6307;&#x5411;&#x7B2C; i-1 &#x4E2A;&#x7ED3;&#x70B9;</span>
    {
        p = p-&gt;next;
        j++;
    }
    <span class="hljs-keyword">if</span> (!p || j &gt; i<span class="hljs-number">-1</span>)
    {
        <span class="hljs-built_in">printf</span>(<span class="hljs-string">&quot;ERROR\n&quot;</span>);
        <span class="hljs-keyword">return</span>;
    }
    s = (LinkList) <span class="hljs-built_in">malloc</span>(NODESIZE); <span class="hljs-comment">// &#x751F;&#x6210;&#x65B0;&#x7ED3;&#x70B9;</span>
    s-&gt;data = e;
    s-&gt;next = p-&gt;next;
    p-&gt;next = s;
} 

<span class="hljs-comment">/**
 * &#x5220;&#x9664;&#x7B2C; i &#x4E2A;&#x4F4D;&#x7F6E;&#x7684;&#x5143;&#x7D20; 
 */</span>
<span class="hljs-function">ElemType <span class="hljs-title">deleteElem</span><span class="hljs-params">(LinkList &amp;L, <span class="hljs-keyword">int</span> i)</span>
</span>{
    LinkList p = L, q;
    <span class="hljs-keyword">int</span> j = <span class="hljs-number">0</span>;
    ElemType t; 
    <span class="hljs-keyword">while</span> (p-&gt;next &amp;&amp; j &lt; i<span class="hljs-number">-1</span>) <span class="hljs-comment">// &#x4F7F; p &#x6307;&#x5411;&#x7B2C; i-1 &#x4E2A;&#x7ED3;&#x70B9; </span>
    {
        p = p-&gt;next;
        j++;
    }
    <span class="hljs-keyword">if</span> (!(p-&gt;next) || j &gt; i<span class="hljs-number">-1</span>)
    {
        <span class="hljs-built_in">printf</span>(<span class="hljs-string">&quot;ERROR\n&quot;</span>);
        <span class="hljs-keyword">return</span> <span class="hljs-number">-1</span>;
    }
    q = p-&gt;next;
    p-&gt;next = q-&gt;next;
    t = q-&gt;data;
    <span class="hljs-built_in">free</span>(q); 
    <span class="hljs-keyword">return</span> t;
}
</code></pre>
<h2 id="&#x5176;&#x4ED6;&#x94FE;&#x8868;">&#x5176;&#x4ED6;&#x94FE;&#x8868;</h2>
<p><code>&#x9759;&#x6001;&#x94FE;&#x8868;</code>&#x4FBF;&#x4E8E;&#x5728;&#x4E0D;&#x8BBE;&#x201C;&#x6307;&#x9488;&#x201D;&#x7C7B;&#x578B;&#x7684;&#x9AD8;&#x7EA7;&#x7A0B;&#x5E8F;&#x8BBE;&#x8BA1;&#x8BED;&#x8A00;&#x4E2D;&#x4F7F;&#x7528;&#x94FE;&#x8868;&#x7ED3;&#x6784;&#xFF0C;&#x4F7F;&#x7528;&#x6E38;&#x6807;&#x4EE3;&#x66FF;&#x6307;&#x9488;&#x6307;&#x793A;&#x7ED3;&#x70B9;&#x5728;&#x6570;&#x7EC4;&#x4E2D;&#x7684;&#x76F8;&#x5BF9;&#x4F4D;&#x7F6E;&#x3002;</p>
<p><code>&#x5FAA;&#x73AF;&#x94FE;&#x8868;</code>&#x662F;&#x8868;&#x4E2D;&#x6700;&#x540E;&#x4E00;&#x4E2A;&#x7ED3;&#x70B9;&#x7684;&#x6307;&#x9488;&#x57DF;&#x6307;&#x5411;&#x5934;&#x7ED3;&#x70B9;&#xFF0C;&#x6574;&#x4E2A;&#x94FE;&#x8868;&#x5F62;&#x6210;&#x4E00;&#x4E2A;&#x73AF;&#x3002;&#x4ECE;&#x8868;&#x4E2D;&#x4EFB;&#x4E00;&#x7ED3;&#x70B9;&#x51FA;&#x53D1;&#x5747;&#x53EF;&#x4EE5;&#x627E;&#x5230;&#x8868;&#x4E2D;&#x5176;&#x4ED6;&#x7ED3;&#x70B9;&#x3002;</p>
<ul>
<li>&#x5FAA;&#x73AF;&#x6761;&#x4EF6;&#x662F; p &#x6216; p-&gt;next &#x662F;&#x5426;&#x4E3A;&#x5934;&#x6307;&#x9488;</li>
</ul>
<p><code>&#x53CC;&#x5411;&#x94FE;&#x8868;</code>&#x7ED3;&#x70B9;&#x4E2D;&#x6709;&#x4E24;&#x4E2A;&#x6307;&#x9488;&#x57DF;&#xFF0C;&#x5176;&#x4E00;&#x6307;&#x5411;&#x76F4;&#x63A5;&#x540E;&#x7EE7;&#xFF0C;&#x53E6;&#x4E00;&#x6307;&#x5411;&#x76F4;&#x63A5;&#x524D;&#x9A71;&#xFF0C;&#x5B58;&#x50A8;&#x7ED3;&#x6784;&#x5B9A;&#x4E49;&#x5982;&#x4E0B;&#xFF1A;</p>
<pre><code class="lang-C"><span class="hljs-keyword">typedef</span> <span class="hljs-keyword">struct</span> DuLNode
{
    ElemType data;
    <span class="hljs-keyword">struct</span> DuLNode *pre;
    <span class="hljs-keyword">struct</span> DuLNode *next;
}DuLNode, *DuLinkList;
</code></pre>

                                
                                </section>
                            
    </div>
    <div class="search-results">
        <div class="has-results">
            
            <h1 class="search-results-title"><span class='search-results-count'></span> results matching "<span class='search-query'></span>"</h1>
            <ul class="search-results-list"></ul>
            
        </div>
        <div class="no-results">
            
            <h1 class="search-results-title">No results matching "<span class='search-query'></span>"</h1>
            
        </div>
    </div>
</div>

                        </div>
                    </div>
                
            </div>

            
                
                <a href="顺序表.html" class="navigation navigation-prev " aria-label="Previous page: 线性表的顺序表示和实现">
                    <i class="fa fa-angle-left"></i>
                </a>
                
                
                <a href="../chapter3/chapter3.html" class="navigation navigation-next " aria-label="Next page: 第三章 栈和队列">
                    <i class="fa fa-angle-right"></i>
                </a>
                
            
        
    </div>

    <script>
        var gitbook = gitbook || [];
        gitbook.push(function() {
            gitbook.page.hasChanged({"page":{"title":"线性表的链式表示和实现","level":"1.3.2","depth":2,"next":{"title":"第三章 栈和队列","level":"1.4","depth":1,"path":"chapter3/chapter3.md","ref":"chapter3/chapter3.md","articles":[{"title":"抽象数据类型栈的定义和实现","level":"1.4.1","depth":2,"path":"chapter3/栈.md","ref":"chapter3/栈.md","articles":[]},{"title":"抽象数据类型队列的定义和实现","level":"1.4.2","depth":2,"path":"chapter3/队列.md","ref":"chapter3/队列.md","articles":[]}]},"previous":{"title":"线性表的顺序表示和实现","level":"1.3.1","depth":2,"path":"chapter2/顺序表.md","ref":"chapter2/顺序表.md","articles":[]},"dir":"ltr"},"config":{"gitbook":"*","theme":"default","variables":{},"plugins":[],"pluginsConfig":{"highlight":{},"search":{},"lunr":{"maxIndexSize":1000000,"ignoreSpecialCharacters":false},"sharing":{"facebook":true,"twitter":true,"google":false,"weibo":false,"instapaper":false,"vk":false,"all":["facebook","google","twitter","weibo","instapaper"]},"fontsettings":{"theme":"white","family":"sans","size":2},"theme-default":{"styles":{"website":"styles/website.css","pdf":"styles/pdf.css","epub":"styles/epub.css","mobi":"styles/mobi.css","ebook":"styles/ebook.css","print":"styles/print.css"},"showLevel":false}},"structure":{"langs":"LANGS.md","readme":"README.md","glossary":"GLOSSARY.md","summary":"SUMMARY.md"},"pdf":{"pageNumbers":true,"fontSize":12,"fontFamily":"Arial","paperSize":"a4","chapterMark":"pagebreak","pageBreaksBefore":"/","margin":{"right":62,"left":62,"top":56,"bottom":56}},"styles":{"website":"styles/website.css","pdf":"styles/pdf.css","epub":"styles/epub.css","mobi":"styles/mobi.css","ebook":"styles/ebook.css","print":"styles/print.css"}},"file":{"path":"chapter2/链表.md","mtime":"2018-08-15T09:03:39.179Z","type":"markdown"},"gitbook":{"version":"3.2.3","time":"2018-09-02T10:05:33.540Z"},"basePath":"..","book":{"language":""}});
        });
    </script>
</div>

        
    <script src="../gitbook/gitbook.js"></script>
    <script src="../gitbook/theme.js"></script>
    
        
        <script src="../gitbook/gitbook-plugin-search/search-engine.js"></script>
        
    
        
        <script src="../gitbook/gitbook-plugin-search/search.js"></script>
        
    
        
        <script src="../gitbook/gitbook-plugin-lunr/lunr.min.js"></script>
        
    
        
        <script src="../gitbook/gitbook-plugin-lunr/search-lunr.js"></script>
        
    
        
        <script src="../gitbook/gitbook-plugin-sharing/buttons.js"></script>
        
    
        
        <script src="../gitbook/gitbook-plugin-fontsettings/fontsettings.js"></script>
        
    

    </body>
</html>

